package com.zhangxiaofanfan.hotcode.third;

/**
 * <a href="https://leetcode.cn/problems/minimum-path-sum/description/?envType=study-plan-v2&envId=top-100-liked">64. 最小路径和</a>
 *
 * @date 2024-07-13 03:14:13
 * @author zhangxiaofanfan
 */
public class HotCode092 {
    public static void main(String[] args) {
        HotCode092 hotCode = new HotCode092();
        int[][] grid = new int[][] {
                {1,3,1},
                {1,5,1},
                {4,2,1}
        };
        System.out.println(hotCode.minPathSum(grid));
    }

    public int minPathSum(int[][] grid) {
        return 0;
    }
}